Hyper-polynomial hierarchies and the polynomial jump
نویسندگان
چکیده
منابع مشابه
Hyper-Polynomial Hierarchies and the NP-Jump
Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length !CK 1 all of which are in PSPACE and uniformly hard for PH, such that successors are NP-jumps of their predecessors. This is analgous to the hyperarithmetic hierarchy, which is defined similarly but with the (recursive) Turing degrees. The lack of uniform...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملWiener Matrix Sequence, Hyper-Wiener Vector, Wiener Polynomial Sequence and Hyper-Wiener Polynomial of Bi-phenylene
The Wiener matrix and the hyper-Wiener number of a tree (acyclic structure), higher Wiener numbers of a tree that can be represented by a Wiener number sequence W, W,W.... whereW = W is the Wiener index, and R W k K ,.... 2 , 1 is the hyper-Wiener number. The concepts of the Wiener vector and hyper-Wiener vector of a graph are introduced for the molecular graph of bi-phenylene. Moreover, ...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance d(u, v) between two vertices u and v of a graph G is equal to the length of a shortest path that connects u and v. Define WW (G, x) = 1/2 ∑ {a,b}⊆V (G) x d(a,b)+d(a,b), where d(G) is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are computed.
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00193-6